Ant-based Load Balancing Algorithm in Structured P2P Systems
نویسندگان
چکیده
Dynamic load balancing is one key adaptation mechanism often deployed in networking and computing systems. Numerous proposals exist for load balancing in P2P networks. All of them will enhance the availability of P2P system to some extent. However, their convergence rate is still low, and the load collection overhead and load transfer overhead are high. In this paper, we propose an ant-based load balancing algorithm, and design a candidate nodes discovery mechanism and a target nodes selection mechanism. Two types of agents are cooperating to realize these mechanisms: Search ant and Guide ant. Performance evaluation shows that, to achieve some specific load balancing effect, compared to the classical algorithms, the convergence rate, the load collection overhead and load transfer overhead of our proposed algorithm are significantly reduced; In addition, this paper analysis how system and algorithm parameters affect the performance of proposed algorithm in depth.
منابع مشابه
A Security-aware Load Balancing Algorithm for Structured P2P Systems Based on Ant Colony Optimization
Abstract In DHT-based P2P systems, the use of DHT and the heterogeneity of node capacities can cause a load imbalance problem, which may affect the DHT system efficiency. Many solutions have been proposed to tackle the load balancing issue. However, the convergence rate is still low, and they reassign loads among nodes without considering security factor. This paper proposes a security-aware lo...
متن کاملReview of Peer to Peer Grid Load Balancing Model Based on Ant Colony Optimization with Resource Management
Grid Systems allow applications to assemble and use collections of resources on an as-needed basis, without regard to its physical location. Grid middleware and other software architecture that manage resources have to locate and allocate resources according to application requirements. They also have to manage other activities like authentication and process creation that are required to prepa...
متن کاملA Load Balancing Algorithm Based on Replication and Movement of Data Items for Dynamic Structured P2p Systems
Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2...
متن کاملA Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems
Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-awa...
متن کاملLoad Balancing in Structured P2P Systems using Server Reassignment Technique
Load balancing among application layer peer-to-peer (P2P) networks is critical for its effectiveness but, is considered to be the most important development for next-generation internet infrastructure. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of θ (log N) in the zone sizes. Two impo...
متن کامل